On solving the cross-dock door assignment problem

A class of strong lower bounds on the solution value a Linearised Integer Programming reformulation is introduced for binary quadratic optimisation model to assign origin and destination nodes strip stack doors, resp., in cross-dock infrastructure. The goal minimise transportation cost commodities be handled at cross-dock. Strip- stack-related decomposition submodels are developed by taking benefit Linearisation Property that appears new model. linear search heuristic also provided obtaining feasible solutions exploiting special structure problem. We present an extensive computational study testbed 55 instances show proposed joint scheme bounding providing very efficient. results obtained our proposal similar those CPLEX 50 taken from literature, but usually time much smaller large instances. comparison with particularly good five largest instances, which make it promising its application real-life cases.